Decomposed multi-objective bin-packing for virtual machine consolidation

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decomposed multi-objective bin-packing for virtual machine consolidation

In this paper, we describe a novel solution to the problem of virtual machine (VM) consolidation, otherwise known as VM-Packing, as applicable to Infrastructure-asa-Service cloud data centers. Our solution relies on the observation that virtual machines are not infinitely variable in resource consumption. Generally, cloud compute providers offer them in fixed resource allocations. Effectively t...

متن کامل

Approximability of Virtual Machine Allocation: Much Harder than Bin Packing

The allocation of virtual machines (VMs) to physical machines in data centers is a key optimization problem for cloud service providers. It is well known that the VM allocation problem contains the classic bin packing problem as special case. This paper investigates to what extent the existing approximability results on bin packing and its generalizations can be applied to the VM allocation pro...

متن کامل

One-Dimension Multi-Objective Bin Packing Problem using Memetic Algorithm

Abstract— Memetic Algorithm has been proven to be successful to find the nearest optimum solution to hard combinatorial optimization problems. In this paper, Memetic algorithm is designed for One-dimension Multi-Objective Bin Packing Problem. Memetic Algorithm is a combination of power of Genetic algorithm with the powerful local search technique to focus on the population of local optima. In t...

متن کامل

On solving multi-objective bin packing problems using memetic algorithms

The bin-packing problem (BPP) and its multi-dimensional variants have many practical applications, such as packing objects in boxes, production planning, multiprocessor scheduling, etc. The classical singleobjective formulation of the two-dimensional bin packing (2D-BPP) consists of packing a set of objects (pieces) in the minimum number of bins (containers). This paper presents a new Pareto-ba...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PeerJ Computer Science

سال: 2016

ISSN: 2376-5992

DOI: 10.7717/peerj-cs.47